More Theory Revision with Queries
نویسندگان
چکیده
! " # $ %$ & (' ) * + " ,-"& /.102 3% 54 6 ) 87:9;"< / = %3,> ) ? @+ A0& )BC %( D E F 2G H & /.I * J # + K # = L, .I"< / > %> "& NM3 5O 62 ) QP( # < 3 L %R &+S "& + 3 D 7T9;" = % U& V D *02 5 +W " * G L %R &% / 5' 3%S 5 3 UX %R" OY 0 ' & 3 &M3 = # J M3 3%3, 5 3 )P ,>' & 3%Z %* I "& W D @[Y\ ]Q%( " %= F %Z J # M3 W I "& J / + = 2, ^ 0_\R]Q%* " %V" P2OX " %R % ' 3 A "& J / + * # = & ` 73^a]b c " 5 / R =M3 %R ,> ) d " W # %Z.N V %@\ e 2, ^ "& W J M W 2 % F %Z J # M3 W "< / %* R 5 # V 6& M8 Pc & # ; " ="LP2OX # " 3%R %( 0Y "& = J # + fWg # (h # c%R 3 3 &M3 3%i "< / 3'L & ) & )P!0& 3 ! 3 L %R %3, * 3 L %R + # "& j %d+ 3 " # $ %iOX )P& & 5 K A " L =UX 8 S # ;M3 # %R 3%$ # "& # = & ` # <0A " 5 & = k L UX S d02 3 &%i 3 30& 0Cf=g& *l Gm 8 5 # nieig D %3, 3 L %R A # + ) " o %I+ p "< / %KOX P2 & 5 L "& N 5 = & T 2 & =UX 3M3 %R% # RP 0& 3 % # <0W 0&0& ) &%d 05 "& I + / "& j q " ? L UX r s / ` #U 3%3f
منابع مشابه
The Complexity of Theory Revision
A knowledge-based system uses its database (a.k.a. its \theory") to produce answers to the queries it receives. Unfortunately, these answers may be incorrect if the underlying theory is faulty. Standard \theory revision" systems use a given set of \labeled queries" (each a query paired with its correct answer) to transform the given theory, by adding and/or deleting either rules and/or antecede...
متن کاملTheory revision with queries: Horn, read-once, and parity formulas
A theory, in this context, is a Boolean formula; it is used to classify instances, or truth assignments. Theories can model real-world phenomena, and can do so more or less correctly. The theory revision, or concept revision, problem is to correct a given, roughly correct concept. This problem is considered here in the model of learning with equivalence and membership queries. A revision algori...
متن کاملTheory revision with queries: results and problems
A brief overview is given of recent results on theory revision with queries for propositional formulas, such as monotone and unate DNF, Horn formulas, read-once formulas, and threshold functions. Several open problems are formulated for revision in propositional and predicate logic, and finite automata.
متن کاملA Logic for Revision and Subjunctive Queries
We present a logic for belief revision in which revision of a theory by a sentence is represented using a conditional connective. The conditional is not primitive, but rather defined using two unary modal operators. Our approach captures and extends the classic AGM model without relying on the Limit Assumption. Reasoning about counterfactual or hypothetical situations is also crucial for AI. Ex...
متن کاملA Logic for evision a &iv eri
We present a logic for belief revision in which revision of a theory by a sentence is represented using a conditional connective. The conditional is not primitive, but rather defined using two unary modal operators. Our approach captures and extends the classic AGM model without relying on the Limit Assumption. Reasoning about counterfactual or hypothetical situations is also crucial for AI. Ex...
متن کاملارائه روشی پویا جهت پاسخ به پرسوجوهای پیوسته تجمّعی اقتضایی
Data Streams are infinite, fast, time-stamp data elements which are received explosively. Generally, these elements need to be processed in an online, real-time way. So, algorithms to process data streams and answer queries on these streams are mostly one-pass. The execution of such algorithms has some challenges such as memory limitation, scheduling, and accuracy of answers. They will be more ...
متن کامل